Covariance matrix filtering with bootstrapped hierarchies

نویسندگان

چکیده

Cleaning covariance matrices is a highly non-trivial problem, yet of central importance in the statistical inference dependence between objects. We propose here probabilistic hierarchical clustering method, named Bootstrapped Average Hierarchical Clustering (BAHC), that particularly effective high-dimensional case, i.e., when there are more objects than features. When applied to DNA microarray, our method yields distinct structures cannot be accounted for by usual clustering. then use global minimum-variance risk management test and find BAHC leads significantly smaller realized compared state-of-the-art linear nonlinear filtering methods case. Spectral decomposition shows better captures persistence structure asset price returns calibration periods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

COVARIANCE MATRIX OF MULTIVARIATE REWARD PROCESSES WITH NONLINEAR REWARD FUNCTIONS

Multivariate reward processes with reward functions of constant rates, defined on a semi-Markov process, first were studied by Masuda and Sumita, 1991. Reward processes with nonlinear reward functions were introduced in Soltani, 1996. In this work we study a multivariate process , , where are reward processes with nonlinear reward functions respectively. The Laplace transform of the covar...

متن کامل

Portfolio Selection Using Tikhonov Filtering to Estimate the Covariance Matrix

Markowitz’s portfolio selection problem chooses weights for stocks in a portfolio based on a covariance matrix of stock returns. Our study proposes to reduce noise in the estimated covariance matrix using a Tikhonov filter function. In addition, we propose a new strategy to resolve the rank deficiency of the covariance matrix, and a method to choose a Tikhonov parameter which determines a filte...

متن کامل

SCMF: Sparse Covariance Matrix Factorization for Collaborative Filtering

Matrix factorization (MF) is a popular collaborative filtering approach for recommender systems due to its simplicity and effectiveness. Existing MF methods either assume that all latent features are uncorrelated or assume that all are correlated. To address the important issue of what structure should be imposed on the features, we investigate the covariance matrix of the latent features learn...

متن کامل

Estimating model error covariance matrix parameters in extended Kalman filtering

The extended Kalman filter (EKF) is a popular state estimation method for nonlinear dynamical models. The model error covariance matrix is often seen as a tuning parameter in EKF, which is often simply postulated by the user. In this paper, we study the filter likelihood technique for estimating the parameters of the model error covariance matrix. The approach is based on computing the likeliho...

متن کامل

Approximate Information Filtering with Multiple Classification Hierarchies

Web page categorization is an approach for improving precision and efficiency of information retrieval on the web by filtering out irrelevant pages. Current approaches to information filtering based on categorization assume the existence of a single classification hierarchy used for filtering. In this paper, we address the problem of filtering information categorized according to different clas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLOS ONE

سال: 2021

ISSN: ['1932-6203']

DOI: https://doi.org/10.1371/journal.pone.0245092